Efficient Partition of N-Dimensional Intervals in the Framework of One-Point-Based Algorithms
نویسنده
چکیده
In this paper, the problem of the minimal description of the structure of a vector function f (x) over an N-dimensional interval is studied. Methods adaptively subdividing the original interval in smaller subintervals and evaluating f (x) at only one point within each subin-terval are considered. Two partition strategies traditionally used for solving this problem are analyzed. A new partition strategy based on an efficient technique developed for diagonal algorithms is proposed and studied.
منابع مشابه
Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملHigh-Dimensional Unsupervised Active Learning Method
In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the da...
متن کاملDesign and Implementation of an Intelligent Photogrammetric System for Control and Guidance of Reconstructive Surgery
The digital image contains efficient and useful information which enables measurement and data acquisition. One of the methods that facilitate measuring and interpreting objects, using the image solely, is close-range photogrammetry. Among the various fields of science, whenever a precise measurement is required, this approach can be applied. One of these fields is Medical Sciences that due to ...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملINTERVAL ANALYSIS-BASED HYPERBOX GRANULAR COMPUTING CLASSIFICATION ALGORITHMS
Representation of a granule, relation and operation between two granules are mainly researched in granular computing. Hyperbox granular computing classification algorithms (HBGrC) are proposed based on interval analysis. Firstly, a granule is represented as the hyperbox which is the Cartesian product of $N$ intervals for classification in the $N$-dimensional space. Secondly, the relation betwee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1103.2657 شماره
صفحات -
تاریخ انتشار 2011